Location:
Search - b tree
Search list
Description: 题意：a->b c :攻克b城堡前要先攻克a城堡攻克b城堡将获得c
共有n个城堡（编号为-n）最多攻克m个城堡能获得的最大收益
把作为树的根把节点连成一棵树
p[root][i]表示在以root为根的子树中选取i个点能获得的最大收益
p[root][i]=max(p[root][i],p[root][i-j]+p[v[e]][j])
当root!=0时每棵子树根必选所以p[root][i]=p[root][i-1]+val[root]
结果为p[0][m]
-Meaning of the questions: a-> bc: overcome b Castle before the first capture of a castle overcome b Castle will get c
The total n Castle (number-n) up to overcome the m castles can get maximum benefit
The root of the tree as a node connected into a tree
p [root] [i] i points to get selected in the sub-tree root-root maximum benefit
p [root] [i] = max (p [root] [i], p [root] [ij]+ p [v [e]] [j])
When the root! = 0 Meike subtree root Required so p [root] [i] = p [root] [i-1]+ val [root]
The result is p [0] [m]
Platform: |
Size: 4096 |
Author: |
Hits:
Description: 【poj】【2031】最小生成树堆优化~Accepted 760 KB 32 ms C++ 1720 B -Minimum spanning tree heap optimization poj2031
Platform: |
Size: 1024 |
Author: yyb |
Hits:
Description: b+树的各种功能，包括创建，插入，删除，添加节点等-tree function b+ including create, insert, delete, add nodes
Platform: |
Size: 363520 |
Author: 王先生 |
Hits:
Description: 2-1以顺序栈作为存储结构 实现顺序栈的入栈运算,出栈运算,并且读取栈顶元素；
2-2以链栈作为存储结构,实现栈上的数据元素的插入运算,删除运算,并读取链栈的栈顶元素；
2-3 以循环队列喂存储结构,实现循环队列的建立,实现循环队列的入队运算,出队运算；
2-4用栈实现括号的匹配问题；
2-5实现汉诺塔问题.；
3-1采用链式存储表示,按给定的先序序列创建二叉树,并输出二叉树。
3-2-1和3-2-2采用二叉链表作为存储结构,建立二叉树,采用递归算法实现二叉树遍历,另外采用非递归算法实现二叉树遍历。
3-3采用二叉树作为存储结构,实现对二叉树的线索化,中序遍历线索二叉树
4-1-1、4-1-2、4-1-3以邻接结构作为存储结构,定义图节点vertexnode,实现图的下列运算：a以邻接表作为存储结构建立图，b按照深度遍历算法遍历图，c按照冠以算法遍历图
4-2用普利姆算法求图的最小生成树，并且分析时间复杂度和空间复杂度-2-1 stack in the order as the storage structure to achieve sequential stack push operation, the stack operation, and read the top element
2-2 chain stack as a storage structure, to achieve the insertion of the data element in the stack on the operator to delete the operation, and reads the chain top of the stack element
2-3 in a circular queue feed storage structures, and the establishment of the circular queue, circular queue enqueue operation dequeue op
2-4 with stack parenthesis matching
2-5 the Towers of Hanoi problem.
3-1 chain store said that according to a given set of first-order sequence to create a binary tree, and outputs a binary tree.
3-2-1 and 3-2-2 binary list as the storage structure, the establishment of a binary tree, using recursive the algorithm binary tree traversal, In addition to the use of non-recursive algorithm binary tree traversal.
3-3 binary tree as a storage structure clues of binary tree in preorder traversal threaded binary
4-1-1,4-1-2,4-1-
Platform: |
Size: 2593792 |
Author: 梁思 |
Hits:
Description: 这是数据结构中学习的B+树，有c++开发实现，详细理解了输的结构，有助于对数据结构初学者，可以参考学习-Is the learning B+ data structure tree a c++ achieve development, a detailed understanding of the structure of the lost, the help of the data structure beginners can refer to learning
Platform: |
Size: 64512 |
Author: 陈欣 |
Hits:
Description: c++实现的b+树源代码，由basetree生成出Btr-b plus tree completed by c++
Platform: |
Size: 9216 |
Author: xun |
Hits:
Description: 编程任务：
对于给定的树，以根结点为起点，对树实现非递归方式广度优先搜索，输出广度优
先搜索序列
数据输入：
由文件input.txt给出输入数据。第1行有1个正整数n，表示给定的二叉树有n个顶
点，编号为1，2，…，n。接下来的n行中，每行有3个正整数a,b,c，分别表示编号为a的结
点的左儿子结点编号为b，右儿子结点编号为c，0表示没有儿子。各结点信息按照层序列表
的顺序给出。-Programming tasks: For a given of the tree, in order to root node as a starting point, right tree implementation non-recursive way of breadth-first search, the output breadth-first search sequence Data Input: by the file input.txt given input data. First 1 Line There are 1 positive integer n, represents a given binary tree with n vertices, numbered 1,2, ..., n. The following n row, each line has three positive integers a, b, c, respectively indicate the reference numbers as a, node point of a left son of node point number is b, right-his son node point number as the c, 0 indicates no sons. Each of the balance point information in accordance with the layer sequence the order of tables are given.
Platform: |
Size: 903168 |
Author: miyor |
Hits:
Description: 四子棋ai，使用图形界面，可以人机对战，使用a-b树实现-Line4 ai, using the graphical interface, you can man-machine war, the use of ab tree implementation
Platform: |
Size: 412672 |
Author: 康乐 |
Hits:
Description: 2. 输入一个中缀表达式，构造表达式树，以文本方式输出树结构。
输入：例如，输入a+b+c*(d+e)
输出：以缩进表示二叉树的层次，左——根、右——叶、上——右子树、下——左子树
―――――――――――――――――――
e
+
d
*
c
+
b
+
a
――――――――――――――――――――――
-2 Enter an infix expression construct an expression tree, the tree structure as text output. Input: For example, enter a+b+c* (d+e) Output: the indentation indicates hierarchical binary tree, left- root and right- leaves, upper- right subtree, down- left subtree------------------- e+ d* c+ b+ a----------------------
Platform: |
Size: 2048 |
Author: wdl |
Hits:
Description: 二叉树算法实现
/*
二叉树搜索, 前序: 中左右 中序: 左中右 后序: 左右中
A(4)
+-------+-------+
B(2) C(9)
+--+--+ +-----+-----+
D(1) E(3) F(5)
+--+--+
G(7)
+--+--+
H(6) I(8)
前序: ABDECFGHI 中序: DBEAFHGIC 后序: DEBHIGFCA
*/
-Binary tree algorithm /* binary search, pre-order: the left and right in order: left, right after the sequence: left in the A (4)+-------+-------+ B (2 ) C (9)+-+-++-----+-----+ D (1) E (3) F (5)+-+-+ G (7)+--+-+ H (6) I (8) pre-order: ABDECFGHI inorder: DBEAFHGIC postorder: DEBHIGFCA * /
Platform: |
Size: 2529280 |
Author: 黄天 |
Hits:
Description: 一条街的一边有几座房子。因为环保原因居民想要在路边种些树，路边的地区被分割成块，并被编号成1..N，每个部分为一个单位尺寸大小并最多可种一棵树，每个居民想在门前种些树并指定了三个号码B,E,T，这三个数表示该居民想在B和E之间最少种T棵树。当
然，B≤E,居民必须记住在指定区不能种多于区域地块数的树，所以T≤E-B+l。居民们想
种树的各自区域可以交叉。你的任务是求出能满足所有要求的最少的树的数量。
-One side of the street there are several houses. Because of environmental reasons people want to plant some trees on the roadside, roadside area is divided into blocks, and was number into 1 .. N, each part of a unit size and up to plant a tree, each resident want to plant some trees in front and specifies three numbers B, E, T, which means that residents want three numbers in between B and E at least kind of T tree. Of course, B ≤ E, residents must remember that in the designated area can not grow more than the number of tree plots area, so T ≤ E-B+l. Residents who want to plant trees in their respective regions can overlap. Your task is to find the minimum required to meet all of the number of trees.
Platform: |
Size: 1024 |
Author: 姜文丽 |
Hits:
Description: 一条街的一边有几座房子。因为环保原因居民想要在路边种些树，路边的地区被分割成块，并被编号成1..N，每个部分为一个单位尺寸大小并最多可种一棵树，每个居民想在门前种些树并指定了三个号码B,E,T，这三个数表示该居民想在B和E之间最少种T棵树。当
然，B≤E,居民必须记住在指定区不能种多于区域地块数的树，所以T≤E-B+l。居民们想
种树的各自区域可以交叉。你的任务是求出能满足所有要求的最少的树的数量。
-One side of the street there are several houses. Because of environmental reasons people want to plant some trees on the roadside, roadside area is divided into blocks, and was number into 1 .. N, each part of a unit size and up to plant a tree for each resident want to plant some trees in front of the three numbers and specify B, E, T, which means that the residents want the three numbers between B and E at least T tree species. When
However, B ≤ E, residents must remember not grow more than the number of trees in the area of land designated areas, so T ≤ E-B+ l. Residents who want to
Plant trees in their respective regions can cross. Your task is to find the minimum number of trees to meet all the requirements.
Platform: |
Size: 7168 |
Author: marry |
Hits:
Description: 设计一个四则表达式分析软件，其接受从文件或键盘输入的四则表达式（运算对象支持整数和变量），给出该表达式的二叉树表达形式，并在键盘上按后续遍历方式输出该二叉树。
例如，输入a+b*c，输出 a b c * +
提示：参考下列的设计指导:
递归下降分析法实验设计思想及算法
为G的每个非终结符号U构造一个递归过程，不妨命名为U。U的产生式的右边指出这个过程的代码结构：
(1)若是终结符号，则和向前看符号对照，若匹配则向前进一个符号；否则出错。
(2)若是非终结符号，则调用与此非终结符对应的过程。当A的右部有多个产生式时,可用选择结构实现。-Design a four-expression analysis software, which accepts four expressions from a file or keyboard input (support integer operands and variables), given expression in the form of a binary tree of the expression, and on the keyboard, press the subsequent traversal of the binary output.
For example, enter a+ b* c, output a b c*+
Note: Refer to the following design guidelines:
Recursive descent experimental design ideas and algorithm analysis
To construct each nonterminal U G a recursive process, it may be named as U. U generates right-hand side indicates the code structure of the process:
(1) If the end of the symbol, and lookaheads contrast, if the match is to advance a symbol otherwise error.
(2) If the non-terminal symbol, then call this nonterminal corresponding process. When there are multiple right part A of production, s
Platform: |
Size: 152576 |
Author: jchen |
Hits:
Description: 苹果树留言板(B) v1.1_appletree_b，php编程聊天留言网站学习源码。-The apple tree message board (B) v1.1_appletree_b, PHP programming chat site learning source.
Platform: |
Size: 64512 |
Author: 什锦丁儿 |
Hits:
Description: C++编写的电路树的生成。生成B，Q，A阵-The circuit tree prepared by C++ generated. To generate B, Q, A Array
Platform: |
Size: 2048 |
Author: nddiffi |
Hits:
Description: a.能够先序输入一颗二叉树。
b.能够实现对此二叉树进行 先序、中序、后序遍历；
c.统计树中叶子节点个数；
d.对二叉树进行 先序、中序、后序线索化；
e.对线索化后的树进行 先序、中序、后序遍历；
f.显示该树。
-a. could preorder enter a binary tree. b able to achieve this binary tree preorder, inorder, postorder . number of leaf nodes c statistic tree . d of the binary tree first order, in sequence, after cued . e for clues after. The tree preorder, inorder, postorder . f displays the tree.
Platform: |
Size: 398336 |
Author: liming |
Hits:
Description: 把字母表示的图状数据结构转换为树状数据结构.采用DefaultMutableTreeNode类的方式建立一个图状数据结构，顶点为字母A、B、C等，你也可以自己设计。可以帮助你把一个复杂的网状关系变成一个条理化的树状关系，并通过一个Tree显示出来。很不可思议吧？看看就知道了！-The chart-like data structures letters converted to tree data structure .Using DefaultMutableTreeNode class way to create a graph like data structure, the apex of the letters A, B, C, etc., you can also design their own. Can help you put a complex network of relationships into a coherent relationship between the tree and displayed by a Tree. Very weird, right? To see to know!
Platform: |
Size: 4096 |
Author: xieyugeng |
Hits:
Description: 程序实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数。
1.先序次序建立一个二叉树 ，用#表示某结点的左右子树是否为空，用于表示该结点是否为叶子或者可能存在左子树or右子树。例如对一个简单的三节点二叉树，节点b和c分别为根节点a的左孩子和右孩子，用先序来创建就表示为ab##c##
2.按先序、中序、后序、层次遍历分别输出二叉树的所有节点
3.求二叉树中所有节点数
4.求二叉树的深度 -Program binary tree node type definitions and basic operation of the binary tree. The program includes a binary tree structure and the specific type of function definitions and the main function of each operation. 1 preorder order to create a binary tree, with the# indicates whether a node is about sub-tree is empty, indicating whether the node is a leaf or there may be left subtree or right subtree. For example for a simple three-node binary tree, the nodes b and c are the root of a left child and right child, with the first order to create it means is ab## c## 2. According to first order, in sequence after sequence, 3 Find all the nodes are output levels of the binary tree binary tree traversal of all nodes 4 binary tree of depth
Platform: |
Size: 1024 |
Author: 杨痒痒 |
Hits:
Description: 用下表给出的字符集和频度的实际统计数据建立哈夫曼树，并实现以下报文的编码和译码：“THIS PROGRAM IS MY FAVORITE”字符 A B C D E F G H I J K L M 频度 64 13 22 32 103 21 15 47 57 1 5 32 20 字符 N O P Q R S T U V W X Y Z 频度 57 63 15 1 48 51 80 23 8 18 1 16 1-The actual statistics of the character set and the frequency established by the following table shows the Huffman tree, and to achieve the following message encoding and decoding: " THIS PROGRAM IS MY FAVORITE" character ABCDEFGHIJKLM frequency 641,322,321,032,115 4757153220 characters NOPQRSTUVWXYZ frequency ° 57 ' 6,315,148,518,023,818,116 1
Platform: |
Size: 3072 |
Author: 梁耀燊 |
Hits:
Description: C++编写的电路树的生成。生成B，Q，A阵-The circuit tree prepared by C++ generated. To generate B, Q, A Array
Platform: |
Size: 2048 |
Author: theac |
Hits: